A Block EM Algorithm for Multivariate Skew Normal and Skew <inline-formula> <tex-math notation="LaTeX">$t$ </tex-math> </inline-formula>-Mixture Models

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A block EM algorithm for multivariate skew normal and skew t-mixture models

Finite mixtures of skew distributions provide a flexible tool for modelling heterogeneous data with asymmetric distributional features. However, parameter estimation via the Expectation-Maximization (EM) algorithm can become very timeconsuming due to the complicated expressions involved in the E-step that are numerically expensive to evaluate. A more time-efficient implementation of the EM algo...

متن کامل

A Survey of Free Math Fonts for TEX and LATEX

Comparison of Features 17 Creation of this Survey 20 ∗Copyright 2006 Stephen G. Hartke. Permission is granted to distribute verbatim or modified copies of this document provided this notice remains intact. An initial version of this article appeared in The PracTEX Journal, 1, 2006, http://www.tug.org/pracjourn/ 2006-1/hartke/. The permanent home of this article is http://ctan.tug.org/tex-archiv...

متن کامل

Math into Tex - a simple introduction to AMS-Latex

When writing can change your life, when writing can enrich you by offering much money, why don't you try it? Are you still very confused of where getting the ideas? Do you still have no idea with what you are going to write? Now, you will need reading. A good writer is a good reader at once. You can define how you write depending on what books to read. This math into tex a simple introduction t...

متن کامل

Minimum Vertex Degree Threshold for <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"></math>tiling

We prove that the vertex degree threshold for tiling C3 4 (the 3-uniform hypergraph with four vertices and two triples) in a 3-uniform hypergraph on n ∈ 4N vertices is (n−1 2 ) − ( 4 n 2 ) + 8n + c, where c = 1 if n ∈ 8N and c = −2 otherwise. This result is best possible, and is one of the first results on vertex degree conditions for hypergraph tiling. C © 2014 Wiley Periodicals, Inc. J. Graph...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Neural Networks and Learning Systems

سال: 2018

ISSN: 2162-237X,2162-2388

DOI: 10.1109/tnnls.2018.2805317